# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def findEvenNumbers(self, digits: List[int]) -> List[int]:
        digits_len = len(digits)
        nums = set()

        for i in range(digits_len):
            for j in range(digits_len):
                for k in range(digits_len):
                    if i == j or i == k or j == k:
                        continue

                    value = digits[i] * 100 + digits[j] * 10 + digits[k]
                    if value >= 100 and value % 2 == 0:
                        nums.add(value)

        return sorted(list(nums))


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([2, 1, 3, 0], [102, 120, 130, 132, 210, 230, 302, 310, 312, 320]),
        ([2, 2, 8, 8, 2], [222, 228, 282, 288, 822, 828, 882]),
        ([3, 7, 5], [])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.findEvenNumbers(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

